Trajectory Planning Using High Order Polynomials under Acceleration Constraint

نویسندگان

  • Rifat Benveniste Department of Electrical and Electronic Engineering, Avrasya University, Trabzon, Turkey
  • Vasif V. Nabiyev Department of Computer Engineering, Karadeniz Technical University, Trabzon, Turkey
چکیده مقاله:

The trajectory planning, which is known as a movement from starting to end point by satisfying the constraints along the path is an essential part of robot motion planning. A common way to create trajectories is to deal with polynomials which have independent coefficients. This paper presents a trajectory formulation as well as a procedure to arrange the suitable trajectories for applications. Created trajectories aimed to be used for safe and smooth navigation in mobile robots. First, a trajectory problem is formulized by considering a border on the robot’s acceleration as the constraint. Also, initial and final conditions for the robot’s velocity along the straight path are settled. To investigate that suggested trajectories perform motions with continuous velocity and smooth acceleration, three trajectory problems are formulated using 3rd, 4th and 5th degree of polynomials. The high-degree polynomials are used because of providing of smoothness, but there is complexity in the calculation of additional coefficients. To reduce the complexity of finding the high-degree polynomial coefficients, the acceleration constraint is simplified and this process is based on a certain scenarios. Afterwards, the coefficients of the used polynomials are found by taking into account the acceleration constraint and velocity conditions. Additionally, to compare the obtained solutions through proposed scenarios, the polynomials` coefficients are solved numerically by Genetic Algorithm (GA). The computer simulation of motions shows that as well as acceleration constraint, the velocity conditions at the beginning and at the end of motion are fulfilled.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

trajectory planning using high order polynomials under acceleration constraint

the trajectory planning, which is known as a movement from starting to end point by satisfying the constraints along the path is an essential part of robot motion planning. a common way to create trajectories is to deal with polynomials which have independent coefficients. this paper presents a trajectory formulation as well as a procedure to arrange the suitable trajectories for applications. ...

متن کامل

Multi-axis High-order Trajectory Planning

This paper presents a trajectory planning algorithm for multi-axis systems. It generates smooth trajectories of any order subject to general initial and final conditions, and constant state and control constraints. The algorithm is recursive, as it constructs a high order trajectory using lower order trajectories. Multi-axis trajectories are computed by synchronizing independent single-axis tra...

متن کامل

Single-trajectory Opportunistic Planning under Uncertainty

An approach to planning for execution in uncertain environments is to characterise the action resource-use profiles using statistical techniques and then base predictions about action outcomes on these estimates. Because the exact profiles of actions cannot be determined prior to actual execution it is possible that these estimates will be flawed, resulting in the failure of the current plan tr...

متن کامل

Trajectory planning under a Stochastic Uncertainty

A trajectory planning problem for linear stochastic differential equations is considered in this paper. The aim is to control the system such that the expected value of the output interpolates given points at given times while the variance and an integral cost of the control effort are minimized. The solution is obtained by using the dynamic programming technique, which allows for several possi...

متن کامل

Some High-order Zero-finding Methods Using Almost Orthogonal Polynomials

Some multipoint iterative methods without memory, for approximating simple zeros of functions of one variable, are described. For m > 0, n ≥ 0, and k satisfying m+1 ≥ k > 0, there exist methods which, for each iteration, use one evaluation of f, f ′, . . . , f (m), followed by n evaluations of f (k), and have order of convergence m + 2n + 1. In particular, there are methods of order 2(n+1) whic...

متن کامل

High-order Retractions on Matrix Manifolds Using Projected Polynomials

We derive a family of high-order, structure-preserving approximations of the Riemannian exponential map on several matrix manifolds, including the group of unitary matrices, the Grassmannian manifold, and the Stiefel manifold. Our derivation is inspired by the observation that if Ω is a skew-Hermitian matrix and t is a sufficiently small scalar, then there exists a polynomial of degree n in tΩ ...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 10  شماره 21

صفحات  1- 6

تاریخ انتشار 2016-12-25

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023